Mirror Lake Management Plan

Management Plan and Comprehensive Lake Inventory of Mirror Lake in Wolfeboro and Tuftonboro, N

An efficient counting method for the colored triad census

The triad census is an important approach to understand local structure in network science, providing comprehensive assessments of the observed relational configurations between triples of actors in a network. However, researchers are often interested in combinations of relational and categorical nodal attributes. In this case, it is desirable to account for the label, or color, of the nodes in the triad census. In this paper, we describe an efficient algorithm for constructing the colored triad census, based, in part, on existing methods for the classic triad census. We evaluate the performance of the algorithm using empirical and simulated data for both undirected and directed graphs. The results of the simulation demonstrate that the proposed algorithm reduces computational time many-fold over the naive approach. We also apply the colored triad census to the Zachary karate club network dataset. We simultaneously show the efficiency of the algorithm, and a way to conduct a statistical test on the census by forming a null distribution from 1,000 realizations of a mixing-matrix conditioned graph and comparing the observed colored triad counts to the expected. From this, we demonstrate the method's utility in our discussion of results about homophily, heterophily, and bridging, simultaneously gained via the colored triad census. In sum, the proposed algorithm for the colored triad census brings novel utility to social network analysis in an efficient package

Freedom on the Net 2014 - Tightening the Net: Governments Expand Online Controls (Summary)

Internet freedom around the world has declined for the fourth consecutive year, with a growing number of countries introducing online censorship and monitoring practices that are simultaneously more aggressive and more sophisticated in their targeting of individual users. This booklet is a summary of findings for the 2014 edition of "Freedom on the Net.

Educational Progress Across Immigrant Generations in California

Explores the disparities in levels of educational progress among different immigrant population groups in California. Examines factors that influence educational attainment among youth by race, ethnicity, and generation. Includes policy considerations

An Analysis of Pulsating Subdwarf B Star EPIC 203948264 Observed during Campaign 2 of K2

We present a preliminary analysis of the newly-discovered pulsating subdwarf B (sdB) star EPIC 203948264. The target was observed for 83 days in short cadence mode during Campaign 2 of K2, the two-gyro mission of the Kepler space telescope. A time-series analysis of the data revealed 22 independent pulsation frequencies in the g-mode region ranging from 100 to 600 μHz (0:5 to 2:8 hours). The main method we use to identify pulsation modes is asymptotic period spacing, and we were able to assign all but one of the pulsations to either l = 1 or l = 2. The average period spacings of both sequences are 261:34 ± 0.78 s and 151:18 ± 0.34 s, respectively. The pulsation amplitudes range from 0.77 ppt down to the detection limit at 0.212 ppt, and are not stable over the duration of the campaign. We detected one possible low-amplitude, l = 2, rotationally split multiplet, which allowed us to constrain the rotation period to 46 days or longer. This makes EPIC 203948264 another slowly rotating sdB star

The Impact of Agricultural Technology Adoption of Income Inequality in Rural China

This study analyzes the impact of government efforts to increase agricultural incomes on income inequality in rural China. It collects and analyzes survey data from 473 households in Yunnan, China in 2004. In particular, it investigates the effects of government efforts to promote improved upland rice technologies. Our analysis shows that farmers who adopted these technologies had incomes approximately 32 percent higher than non-adopters. While much of this came from increased incomes from the selling of upland rice, adopters also enjoyed higher incomes from other cash crops. We attribute this to technology spillovers. Despite substantial increases associated with the adoption of improved upland rice technologies, we estimate that the impact on income inequality was relatively slight. This is primarily due to the fact that low income farmers had relatively high rates of technology adoption.Rural economic development; Chinese economic development; upland rice; rural-urban income inequality; agricultural income policy

Water and Religious Life in the Roman Near East. Gods, Spaces and Patterns of Worship.

This thesis examines the relationship between water and religious life in the Roman Near East. It analyses the ways in which religious communities engaged with water in the characterisation of gods, the organisation of sacred spaces and the development of patterns of worship. These three themes – gods, spaces and patterns of worship – constitute the core chapters of this thesis. This study demonstrates that the religious communities of the Roman Near East engaged critically with water in the development of their traditions and practices, and that the nature of this engagement was directly influenced by local environmental conditions. Previous scholarship has consistently marginalised the importance of water in religious life across the Roman Near East. This disregard began with the classification of water as a primitive layer of religion and continued with either indifference to the nuances of the local environment or unquestioning acceptance of water’s presence in the religious sphere. As a result, by neglecting to explore the nuances with which the relationship between water and religious life manifested, we have overlooked the many ways in which the religious communities of the Roman Near East interacted with the varied bodies of water that formed their local environment. To address this marginalisation, this study elevates water and its particular environmental dimensions to the forefront of discussion. It achieves this by utilising environmental data in order to determine the local nuances of the region’s diverse landscapes, as well as drawing on a range of material – including literature, religious architecture, inscriptions, sculpture and mosaics, and coinage – from which we might seek to understand religious life in the Roman Near East. This study concludes that the relationship between water and religious life in the Roman Near East emerges as one that is fundamentally grounded in local variety

Optimized hash for network path encoding with minimized false positives

The Bloom filter is a space efficient randomized data structure for representing a set and supporting membership queries. Bloom filters intrinsically allow false positives. However, the space savings they offer outweigh the disadvantage if the false positive rates are kept sufficiently low. Inspired by the recent application of the Bloom filter in a novel multicast forwarding fabric, this paper proposes a variant of the Bloom filter, the optihash. The optihash introduces an optimization for the false positive rate at the stage of Bloom filter formation using the same amount of space at the cost of slightly more processing than the classic Bloom filter. Often Bloom filters are used in situations where a fixed amount of space is a primary constraint. We present the optihash as a good alternative to Bloom filters since the amount of space is the same and the improvements in false positives can justify the additional processing. Specifically, we show via simulations and numerical analysis that using the optihash the false positives occurrences can be reduced and controlled at a cost of small additional processing. The simulations are carried out for in-packet forwarding. In this framework, the Bloom filter is used as a compact link/route identifier and it is placed in the packet header to encode the route. At each node, the Bloom filter is queried for membership in order to make forwarding decisions. A false positive in the forwarding decision is translated into packets forwarded along an unintended outgoing link. By using the optihash, false positives can be reduced. The optimization processing is carried out in an entity termed the Topology Manger which is part of the control plane of the multicast forwarding fabric. This processing is only carried out on a per-session basis, not for every packet. The aim of this paper is to present the optihash and evaluate its false positive performances via simulations in order to measure the influence of different parameters on the false positive rate. The false positive rate for the optihash is then compared with the false positive probability of the classic Bloom filter

Do antibiotics prevent recurrent UTI in children with anatomic abnormalities?

Evidence is insufficient to recommend for or against antibiotic prophylaxis to prevent recurrent urinary tract infections (UTI) in children with anatomic abnormalities. Guidelines acknowledge this lack of evidence, but still recommend using prophylactic antibiotics in children with vesiculoureteral reflux (strength of recommendation: B, based on poor-quality or inconclusive cohort and randomized controlled studies). No controlled, prospective studies have examined the effectiveness of prophylactic antibiotics to prevent UTI recurrence or renal scarring

Yes-no Bloom filter: A way of representing sets with fewer false positives

The Bloom filter (BF) is a space efficient randomized data structure particularly suitable to represent a set supporting approximate membership queries. BFs have been extensively used in many applications especially in networking due to their simplicity and flexibility. The performances of BFs mainly depends on query overhead, space requirements and false positives. The aim of this paper is to focus on false positives. Inspired by the recent application of the BF in a novel multicast forwarding fabric for information centric networks, this paper proposes the yes-no BF, a new way of representing a set, based on the BF, but with significantly lower false positives and no false negatives. Although it requires slightly more processing at the stage of its formation, it offers the same processing requirements for membership queries as the BF. After introducing the yes-no BF, we show through simulations, that it has better false positive performance than the BF